A characterization of product-form exchangeable feature probability functions

نویسندگان

  • Marco Battiston
  • Stefano Favaro
  • Daniel M. Roy
  • Yee Whye Teh
چکیده

We characterize the class of exchangeable feature allocations assigning probability Vn,k ∏k l=1WmlUn−ml to a feature allocation of n individuals, displaying k features with counts (m1, . . . ,mk) for these features. Each element of this class is parametrized by a countable matrix V and two sequences U and W of non-negative weights. Moreover, a consistency condition is imposed to guarantee that the distribution for feature allocations of n− 1 individuals is recovered from that of n individuals, when the last individual is integrated out. In Theorem 1.1, we prove that the only members of this class satisfying the consistency condition are mixtures of the Indian Buffet Process over its mass parameter γ and mixtures of the Beta–Bernoulli model over its dimensionality parameter N . Hence, we provide a characterization of these two models as the only, up to randomization of the parameters, consistent exchangeable feature allocations having the required product form.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Allocations, Probability Functions, and Paintboxes

The problem of inferring a clustering of a data set has been the subject of much research in Bayesian analysis, and there currently exists a solid mathematical foundation for Bayesian approaches to clustering. In particular, the class of probability distributions over partitions of a data set has been characterized in a number of ways, including via exchangeable partition probability functions ...

متن کامل

Clusters and Features from Combinatorial Stochastic Processes

In partitioning-­‐-­‐-­‐a.k.a. clustering-­‐-­‐-­‐data, we associate each data point with one and only one of some collection of groups called clusters or partition blocks. Here, we formally establish an analogous problem, called feature allocation, for associating data points with arbitrary non-­‐negative integer numbers of groups, now called features or topics. Just as the exchangeable partit...

متن کامل

On Bochner's and Polya's Characterizations of Positive-Definite Kernels and the Respective Random Feature Maps

Positive-definite kernel functions are fundamental elements of kernel methods and Gaussian processes. A well-known construction of such functions comes from Bochner’s characterization, which connects a positive-definite function with a probability distribution. Another construction, which appears to have attracted less attention, is Polya’s criterion that characterizes a subset of these functio...

متن کامل

On the geometry of a class of invariant measures and a problem of Aldous

In his survey [4] of notions of exchangeability, Aldous introduced a form of exchangeability corresponding to the symmetries of the infinite discrete cube, and asked whether these exchangeable probability measures enjoy a representation theorem similar to those for exchangeable sequences [11], arrays [12, 13, 1, 2] and set-indexed families [15]. In this note we to prove that, whereas the known ...

متن کامل

On the extendibility of finitely exchangeable probability measures

We give necessary and sufficient conditions in order that a finite sequence (X1, . . . , Xn) of exchangeable random elements in a fairly general space S be extendible to a longer finite or to an infinite exchangeable sequence. This is done by formulating the extendibility problem as the extension problem for certain bounded linear functionals on suitable normed spaces and by using the Hahn-Bana...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016